Linear Combinations of Sets of Consecutive Integers

نویسنده

  • R. RADO
چکیده

Let k-l,ml,..~+k denote non-negative integers, and suppose the greatest common divisor of ml,...,mk is 1 . We show that if '1, "',sk are sufficiently long blocks of consecutive integers, then the set mlSl+ . ..+mkSk contains a sizable block of consecutive integers. For example; if m and n are relatively prime natural numbers, and U, U ? Vt V are integers with U-u 2 n-l , V-v 2 m-l 1 then the set m{u,u+l, . . ..U)+n[v.v+l,...,V] contains the set cmu+nva(m,n), . . . ,mU+nV-rr(m,n)] where o(m,n) = (m-l)(n-1) is the largest number such that a(m,n)-1 cannot be expressed in the form mx+ny with x and y non-negative integers. This research was supported in part by the Office of Naval Research under contract number N-OOO&67-A-0112-0057 NR 044-402, and by the National Science Foundation under grant number GJ-992. Reproduction in whole or in part is permitted for any purpose of the United States Government. -/ * Currently Visiting Professor, Faculty of Mathematics, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada. d

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representing integers as linear combinations of powers

At a conference in Debrecen in October 2010 Nathanson announced some results concerning the arithmetic diameters of certain sets. (See his paper in the present volume.) He proposed some related problems on the representation of integers by sums or differences of powers of 2 and of 3. In this note we prove some results on this problem and the more general problem about the representation by line...

متن کامل

Uniform perfect systems of sets of iterated differences of size 41

A general problem raised by the work of Kreweras and Loeb concerns the existence of partitions of runs of consecutive integers into sets, known as sets of iterated differences, the s(s + 1 )/2 elements of which can be expressed as certain linear combinations of s integer valued parameters. In this paper we study the case of four parameters. By examining properties already present in examples wi...

متن کامل

Some integer formula-encodings and related algorithms

We investigate the special class of formulas made up of arbitrary but finite combinations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such formulas, we describe two essentially distinct families of canonical formula-encodings for integers, respectively deduced from the decimal encoding and the fund...

متن کامل

EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...

متن کامل

Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System

In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998